Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis

Schedule generation schemes for the job-shop problem with sequence-dependent setup times: dominance properties and computational analysis

We consider the job-shop problem with sequence-dependent setup times. We focus on the formal definition of schedule generation schemes (SGSs) based on the semi-active, active, and non-delay schedule categories. We study dominance properties of the sets of schedules obtainable with each SGS. We show how the proposed SGSs can be used within single-pass and multi-pass priority rule based heuristic...

Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

A Job Shop Scheduling Problem with Sequence-Dependent Setup Times Considering Position-Based Learning Effects and Availability Constraints

 Sequence dependent set-up times scheduling problems (SDSTs), availability constraint and transportation times are interesting and important issues in production management, which are often addressed separately. In this paper, the SDSTs job shop scheduling problem with position-based learning effects, job-dependent transportation times and multiple preventive maintenance activities is studied. ...

A bi-objective model for the assembly flow shop scheduling problem with sequence dependent setup times and considering energy consumption

Sequence-Dependent Setup Times in a Two-Machine Job-Shop with Minimizing the Schedule Length

This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup times and removal times. The processing of each job includes at most two operations that have to be non-preemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially s...